Generalized Bin Packing Problems
نویسنده
چکیده
Original Citation: Baldi M.M. Generalized Bin Packing Problems. In: 4OR. ISSN 1619-4500 (In Press) Availability: This version is available at : http://porto.polito.it/2523486/ since: December 2013 Publisher: Springer Published version: DOI:10.1007/s10288-013-0252-1 Terms of use: This article is made available under terms and conditions applicable to Open Access Policy Article ("Public All rights reserved") , as described at http://porto.polito.it/terms_and_conditions. html Porto, the institutional repository of the Politecnico di Torino, is provided by the University Library and the IT-Services. The aim is to enable open access to all the world. Please share with us how this access benefits you. Your story matters.
منابع مشابه
The Generalized Bin Packing Problem: Models and Bounds
We present the Generalized Bin Packing Problem (GBPP), a new packing problem where, given a set of items characterized by volume and profit and a set of bins with given volumes and costs, one aims to select the subsets of profitable items and appropriate bins to optimize an objective function which combines the cost of using the bins and the profit yielded by loading the selected items. The GBP...
متن کاملThe Generalized Bin Packing Problem with Bin-Dependent Item Profits
In this paper, we introduce the Generalized Bin Packing Problem with bindependent item profits (GBPPI), a variant of the Generalized Bin Packing Problem. In GBPPI, various bin types are available with their own capacities and costs. A set of compulsory and non-compulsory items are also given, with volume and bin-dependent profits. The aim of GBPPI is to determine an assignment of items to bins ...
متن کاملTowards Bin Packing (preliminary problem survey, models with multiset estimates)
The paper described a generalized integrated glance to bin packing problems including a brief literature survey and some new problem formulations for the cases of multiset estimates of items. A new systemic viewpoint to bin packing problems is suggested: (a) basic element sets (item set, bin set, item subset assigned to bin), (b) binary relation over the sets: relation over item set as compatib...
متن کاملThe Generalized Bin Packing Problem
We introduce the Generalized Bin Packing Problem, a new packing problem where, given a set of items characterized by volume and profit and a set of bins with given volumes and costs, one aims to select the subsets of profitable items and appropriate bins to optimize an objective function combining the cost of using the bins and the profit yielded by loading the selected items. The Generalized B...
متن کاملDesign and Analysis of Meta-heuristics for Constrained Optimization Problems
This goal of this senior design project is to implement and analyze the effectiveness of different meta-heuristic algorithms on solving two constrained optimization problems: the Bin Packing Problem and the Generalized Assignment Problem. Specifically, we are most interested in applying a certain meta-heuristic technique, the Genetic Algorithm. Although genetic algorithms have been used to solv...
متن کاملKnapsack problems with sigmoid utilities: Approximation algorithms via hybrid optimization
We study a class of non-convex optimization problems involving sigmoid functions. We show that sigmoid functions impart a combinatorial element to the optimization variables and make the global optimization computationally hard. We formulate versions of the knapsack problem, the generalized assignment problem and the bin-packing problem with sigmoid utilities. We merge approximation algorithms ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- 4OR
دوره 12 شماره
صفحات -
تاریخ انتشار 2014